0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.11/0.31	% Computer : n019.cluster.edu
0.11/0.31	% Model    : x86_64 x86_64
0.11/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.31	% Memory   : 8042.1875MB
0.11/0.31	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.31	% CPULimit   : 1920
0.11/0.31	% WCLimit    : 240
0.11/0.31	% DateTime   : Wed Jul 30 02:14:49 EDT 2025
0.11/0.32	% CPUTime    : 
0.19/0.46	Running higher-order theorem proving
0.19/0.47	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.ktHV3oLLZg/E---3.1_20315.p
2.43/0.77	# Version: 3.0.0-ho
2.43/0.77	# Preprocessing class: HSSSSMSSSSSNSSA.
2.43/0.77	# Scheduled 8 strats onto 8 cores with 240 seconds (1920 total)
2.43/0.77	# Starting post_as_ho12 with 240s (1) cores
2.43/0.77	# Starting new_bool_9 with 240s (1) cores
2.43/0.77	# Starting post_as_ho1 with 240s (1) cores
2.43/0.77	# Starting post_as_ho4 with 240s (1) cores
2.43/0.77	# Starting post_as_ho2 with 240s (1) cores
2.43/0.77	# Starting ehoh_best2_full_lfho with 240s (1) cores
2.43/0.77	# Starting full_lambda_10 with 240s (1) cores
2.43/0.77	# Starting new_ho_8 with 240s (1) cores
2.43/0.77	# post_as_ho1 with pid 20395 completed with status 0
2.43/0.77	# Result found by post_as_ho1
2.43/0.77	# Preprocessing class: HSSSSMSSSSSNSSA.
2.43/0.77	# Scheduled 8 strats onto 8 cores with 240 seconds (1920 total)
2.43/0.77	# Starting post_as_ho12 with 240s (1) cores
2.43/0.77	# Starting new_bool_9 with 240s (1) cores
2.43/0.77	# Starting post_as_ho1 with 240s (1) cores
2.43/0.77	# No SInE strategy applied
2.43/0.77	# Search class: HGHNF-FFSF11-SSSFFSBC
2.43/0.77	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
2.43/0.77	# Starting ehoh_best2_full_lfho with 130s (1) cores
2.43/0.77	# ehoh_best2_full_lfho with pid 20401 completed with status 0
2.43/0.77	# Result found by ehoh_best2_full_lfho
2.43/0.77	# Preprocessing class: HSSSSMSSSSSNSSA.
2.43/0.77	# Scheduled 8 strats onto 8 cores with 240 seconds (1920 total)
2.43/0.77	# Starting post_as_ho12 with 240s (1) cores
2.43/0.77	# Starting new_bool_9 with 240s (1) cores
2.43/0.77	# Starting post_as_ho1 with 240s (1) cores
2.43/0.77	# No SInE strategy applied
2.43/0.77	# Search class: HGHNF-FFSF11-SSSFFSBC
2.43/0.77	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
2.43/0.77	# Starting ehoh_best2_full_lfho with 130s (1) cores
2.43/0.77	# Preprocessing time       : 0.001 s
2.43/0.77	
2.43/0.77	# Proof found!
2.43/0.77	# SZS status Theorem
2.43/0.77	# SZS output start CNFRefutation
2.43/0.77	thf(decl_sort1, type, a: $tType).
2.43/0.77	thf(decl_23, type, epred1_0: a > a > $o).
2.43/0.77	thf(decl_24, type, epred2_0: a > $o).
2.43/0.77	thf(decl_25, type, esk1_1: a > a).
2.43/0.77	thf(decl_26, type, esk2_1: (a > $o) > a).
2.43/0.77	thf(decl_27, type, esk3_0: a).
2.43/0.77	thf(cTRANS_IND, conjecture, ![X1:a > a > $o, X2:a > $o]:((![X3:a]:((X2 @ X3))<=(![X3:a]:((![X4:a]:(((X1 @ X4 @ X3)=>(X2 @ X4)))=>(X2 @ X3)))&![X5:a > $o]:((?[X4:a]:((![X6:a]:((~((X5 @ X6))<=(X1 @ X6 @ X4)))&(X5 @ X4)))<=?[X7:a]:((X5 @ X7))))))), file('/export/starexec/sandbox/tmp/tmp.ktHV3oLLZg/E---3.1_20315.p', cTRANS_IND)).
2.43/0.77	thf(c_0_1, negated_conjecture, ~(![X1:a > a > $o, X2:a > $o]:(((![X3:a]:((![X4:a]:(((X1 @ X4 @ X3)=>(X2 @ X4)))=>(X2 @ X3)))&![X5:a > $o]:((?[X7:a]:((X5 @ X7))=>?[X4:a]:((![X6:a]:(((X1 @ X6 @ X4)=>~((X5 @ X6))))&(X5 @ X4))))))=>![X3:a]:((X2 @ X3))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTRANS_IND])])).
2.43/0.77	thf(c_0_2, negated_conjecture, ![X19:a, X21:a > $o, X22:a, X24:a]:((((((epred1_0 @ (esk1_1 @ X19) @ X19)|(epred2_0 @ X19))&(~(epred2_0 @ (esk1_1 @ X19))|(epred2_0 @ X19)))&((~(epred1_0 @ X24 @ (esk2_1 @ X21))|~(X21 @ X24)|~(X21 @ X22))&((X21 @ (esk2_1 @ X21))|~(X21 @ X22))))&~(epred2_0 @ esk3_0))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])).
2.43/0.77	thf(c_0_3, negated_conjecture, ![X2:a > $o, X3:a, X4:a]:((~((epred1_0 @ X3 @ (esk2_1 @ X2)))|~((X2 @ X3))|~((X2 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
2.43/0.77	thf(c_0_4, negated_conjecture, ![X4:a, X3:a, X2:a > $o]:(((X2 @ X3)|(X2 @ X4)|~((epred1_0 @ X3 @ (esk2_1 @ (^[Z0/* 7 */:a]:(~((X2 @ Z0))))))))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_3])).
2.43/0.77	thf(c_0_5, negated_conjecture, ![X3:a]:(((epred1_0 @ (esk1_1 @ X3) @ X3)|(epred2_0 @ X3))), inference(split_conjunct,[status(thm)],[c_0_2])).
2.43/0.77	thf(c_0_6, negated_conjecture, ![X2:a > $o, X3:a]:(((X2 @ (esk2_1 @ X2))|~((X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])).
2.43/0.77	thf(c_0_7, negated_conjecture, ![X3:a]:(((epred2_0 @ X3)|~((epred2_0 @ (esk1_1 @ X3))))), inference(split_conjunct,[status(thm)],[c_0_2])).
2.43/0.77	thf(c_0_8, negated_conjecture, ![X2:a > $o, X3:a]:(((X2 @ (esk1_1 @ (esk2_1 @ (^[Z0/* 7 */:a]:(~((X2 @ Z0)))))))|(epred2_0 @ (esk2_1 @ (^[Z0/* 7 */:a]:(~((X2 @ Z0))))))|(X2 @ X3))), inference(spm,[status(thm)],[c_0_4, c_0_5])).
2.43/0.77	thf(c_0_9, negated_conjecture, ![X3:a, X2:a > $o]:(((X2 @ X3)|~((X2 @ (esk2_1 @ (^[Z0/* 7 */:a]:(~((X2 @ Z0))))))))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_6])).
2.43/0.77	thf(c_0_10, negated_conjecture, ~((epred2_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_2])).
2.43/0.77	thf(c_0_11, negated_conjecture, ![X3:a]:((epred2_0 @ X3)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_8]), c_0_9])).
2.43/0.77	thf(c_0_12, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_11])]), ['proof']).
2.43/0.77	# SZS output end CNFRefutation
2.43/0.77	# Parsed axioms                        : 2
2.43/0.77	# Removed by relevancy pruning/SinE    : 0
2.43/0.77	# Initial clauses                      : 6
2.43/0.77	# Removed in clause preprocessing      : 1
2.43/0.77	# Initial clauses in saturation        : 5
2.43/0.77	# Processed clauses                    : 3648
2.43/0.77	# ...of these trivial                  : 1
2.43/0.77	# ...subsumed                          : 2918
2.43/0.77	# ...remaining for further processing  : 729
2.43/0.77	# Other redundant clauses eliminated   : 40
2.43/0.77	# Clauses deleted for lack of memory   : 0
2.43/0.77	# Backward-subsumed                    : 8
2.43/0.77	# Backward-rewritten                   : 599
2.43/0.77	# Generated clauses                    : 22038
2.43/0.77	# ...of the previous two non-redundant : 20267
2.43/0.77	# ...aggressively subsumed             : 0
2.43/0.77	# Contextual simplify-reflections      : 13
2.43/0.77	# Paramodulations                      : 21713
2.43/0.77	# Factorizations                       : 12
2.43/0.77	# NegExts                              : 23
2.43/0.77	# Equation resolutions                 : 57
2.43/0.77	# Disequality decompositions           : 0
2.43/0.77	# Total rewrite steps                  : 3923
2.43/0.77	# ...of those cached                   : 3909
2.43/0.77	# Propositional unsat checks           : 0
2.43/0.77	#    Propositional check models        : 0
2.43/0.77	#    Propositional check unsatisfiable : 0
2.43/0.77	#    Propositional clauses             : 0
2.43/0.77	#    Propositional clauses after purity: 0
2.43/0.77	#    Propositional unsat core size     : 0
2.43/0.77	#    Propositional preprocessing time  : 0.000
2.43/0.77	#    Propositional encoding time       : 0.000
2.43/0.77	#    Propositional solver time         : 0.000
2.43/0.77	#    Success case prop preproc time    : 0.000
2.43/0.77	#    Success case prop encoding time   : 0.000
2.43/0.77	#    Success case prop solver time     : 0.000
2.43/0.77	# Current number of processed clauses  : 88
2.43/0.77	#    Positive orientable unit clauses  : 3
2.43/0.77	#    Positive unorientable unit clauses: 0
2.43/0.77	#    Negative unit clauses             : 7
2.43/0.77	#    Non-unit-clauses                  : 78
2.43/0.77	# Current number of unprocessed clauses: 16605
2.43/0.77	# ...number of literals in the above   : 41552
2.43/0.77	# Current number of archived formulas  : 0
2.43/0.77	# Current number of archived clauses   : 641
2.43/0.77	# Clause-clause subsumption calls (NU) : 10271
2.43/0.77	# Rec. Clause-clause subsumption calls : 7722
2.43/0.77	# Non-unit clause-clause subsumptions  : 1473
2.43/0.77	# Unit Clause-clause subsumption calls : 720
2.43/0.77	# Rewrite failures with RHS unbound    : 0
2.43/0.77	# BW rewrite match attempts            : 1759
2.43/0.77	# BW rewrite match successes           : 561
2.43/0.77	# Condensation attempts                : 0
2.43/0.77	# Condensation successes               : 0
2.43/0.77	# Termbank termtop insertions          : 542537
2.43/0.77	# Search garbage collected termcells   : 248
2.43/0.77	
2.43/0.77	# -------------------------------------------------
2.43/0.77	# User time                : 0.281 s
2.43/0.77	# System time              : 0.010 s
2.43/0.77	# Total time               : 0.291 s
2.43/0.77	# Maximum resident set size: 1736 pages
2.43/0.77	
2.43/0.77	# -------------------------------------------------
2.43/0.77	# User time                : 0.281 s
2.43/0.77	# System time              : 0.013 s
2.43/0.77	# Total time               : 0.294 s
2.43/0.77	# Maximum resident set size: 1728 pages
2.43/0.77	% E exiting
2.43/0.77	% E exiting
2.43/0.78	EOF